0.07/0.15	% Problem    : Vampire---4.8_32376 : TPTP v0.0.0. Released v0.0.0.
0.07/0.16	% Command    : run_E %s %d THM
0.17/0.38	% Computer : n019.cluster.edu
0.17/0.38	% Model    : x86_64 x86_64
0.17/0.38	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.17/0.38	% Memory   : 8042.1875MB
0.17/0.38	% OS       : Linux 3.10.0-693.el7.x86_64
0.17/0.38	% CPULimit   : 1440
0.17/0.38	% WCLimit    : 180
0.17/0.38	% DateTime   : Mon Jul  3 13:06:19 EDT 2023
0.17/0.38	% CPUTime    : 
0.37/0.54	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.TPiHBH1i7c/Vampire---4.8_32376
0.37/0.54	# Version: 3.1pre001-ho
0.40/0.59	# Preprocessing class: HSLMSMSSLLLCHSA.
0.40/0.59	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.40/0.59	# Starting lpo1_fix with 540s (3) cores
0.40/0.59	# Starting full_lambda_9 with 180s (1) cores
0.40/0.59	# Starting almost_fo_4 with 180s (1) cores
0.40/0.59	# Starting new_ho_9 with 180s (1) cores
0.40/0.59	# Starting pre_casc_4 with 180s (1) cores
0.40/0.59	# Starting ho_unfolding_6 with 180s (1) cores
0.40/0.59	# full_lambda_9 with pid 32555 completed with status 0
0.40/0.59	# Result found by full_lambda_9
0.40/0.59	# Preprocessing class: HSLMSMSSLLLCHSA.
0.40/0.59	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.40/0.59	# Starting lpo1_fix with 540s (3) cores
0.40/0.59	# Starting full_lambda_9 with 180s (1) cores
0.40/0.59	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.40/0.59	# Search class: HGHSM-FFLM32-DHSMMSBN
0.40/0.59	# partial match(2): HGHSM-FSLM32-MHSMMSBN
0.40/0.59	# Scheduled 12 strats onto 1 cores with 180 seconds (180 total)
0.40/0.59	# Starting full_lambda_5 with 15s (1) cores
0.40/0.59	# full_lambda_5 with pid 32560 completed with status 0
0.40/0.59	# Result found by full_lambda_5
0.40/0.59	# Preprocessing class: HSLMSMSSLLLCHSA.
0.40/0.59	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.40/0.59	# Starting lpo1_fix with 540s (3) cores
0.40/0.59	# Starting full_lambda_9 with 180s (1) cores
0.40/0.59	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.40/0.59	# Search class: HGHSM-FFLM32-DHSMMSBN
0.40/0.59	# partial match(2): HGHSM-FSLM32-MHSMMSBN
0.40/0.59	# Scheduled 12 strats onto 1 cores with 180 seconds (180 total)
0.40/0.59	# Starting full_lambda_5 with 15s (1) cores
0.40/0.59	# Preprocessing time       : 0.004 s
0.40/0.59	# Presaturation interreduction done
0.40/0.59	
0.40/0.59	# Proof found!
0.40/0.59	# SZS status Theorem
0.40/0.59	# SZS output start CNFRefutation
0.40/0.59	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
0.40/0.59	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
0.40/0.59	thf(decl_25, type, in: $i > $i > $o).
0.40/0.59	thf(decl_77, type, e_is: $i > $i > $i > $o).
0.40/0.59	thf(decl_78, type, amone: $i > ($i > $o) > $o).
0.40/0.59	thf(decl_123, type, nat: $i).
0.40/0.59	thf(decl_124, type, n_is: $i > $i > $o).
0.40/0.59	thf(decl_142, type, n_pl: $i > $i > $i).
0.40/0.59	thf(decl_148, type, esk1_0: $i).
0.40/0.59	thf(decl_149, type, esk2_0: $i).
0.40/0.59	thf(decl_150, type, esk3_0: $i).
0.40/0.59	thf(decl_151, type, esk4_0: $i).
0.40/0.59	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.TPiHBH1i7c/Vampire---4.8_32376', def_all_of)).
0.40/0.59	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.TPiHBH1i7c/Vampire---4.8_32376', def_is_of)).
0.40/0.59	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/tmp/tmp.TPiHBH1i7c/Vampire---4.8_32376', def_e_is)).
0.40/0.59	thf(def_amone, axiom, ((amone)=(^[X1:$i, X2:$i > $o]:((all_of @ (^[X4:$i]:((in @ X4 @ X1))) @ (^[X4:$i]:((all_of @ (^[X10:$i]:((in @ X10 @ X1))) @ (^[X10:$i]:(((X2 @ X4)=>((X2 @ X10)=>(e_is @ X1 @ X4 @ X10)))))))))))), file('/export/starexec/sandbox/tmp/tmp.TPiHBH1i7c/Vampire---4.8_32376', def_amone)).
0.40/0.59	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/tmp/tmp.TPiHBH1i7c/Vampire---4.8_32376', def_n_is)).
0.40/0.59	thf(satz8a, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X186:$i]:((in @ X186 @ nat))) @ (^[X187:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((n_is @ X187 @ X4)<=(n_is @ (n_pl @ X1 @ X187) @ (n_pl @ X1 @ X4)))))))))))), file('/export/starexec/sandbox/tmp/tmp.TPiHBH1i7c/Vampire---4.8_32376', satz8a)).
0.40/0.59	thf(satz8b, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X195:$i]:((in @ X195 @ nat))) @ (^[X196:$i]:((amone @ nat @ (^[X4:$i]:((n_is @ X1 @ (n_pl @ X196 @ X4))))))))))), file('/export/starexec/sandbox/tmp/tmp.TPiHBH1i7c/Vampire---4.8_32376', satz8b)).
0.40/0.59	thf(c_0_7, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.40/0.59	thf(c_0_8, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.40/0.59	thf(c_0_9, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.40/0.59	thf(c_0_10, plain, ((amone)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((![X311:$i]:(((((in @ X311 @ Z0)))=>((![X310:$i]:(((((in @ X310 @ Z0)))=>(((Z1 @ X311)=>((Z1 @ X310)=>(((X311)=(X310)))))))))))))))), inference(fof_simplification,[status(thm)],[def_amone])).
0.40/0.59	thf(c_0_11, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_7, c_0_8])).
0.40/0.59	thf(c_0_12, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_9])).
0.40/0.59	thf(c_0_13, plain, ((amone)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((![X311:$i]:(((((in @ X311 @ Z0)))=>((![X310:$i]:(((((in @ X310 @ Z0)))=>(((Z1 @ X311)=>((Z1 @ X310)=>(((X311)=(X310)))))))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_10, c_0_11]), c_0_9])).
0.40/0.59	thf(c_0_14, plain, ![X334:$i]:(((in @ X334 @ nat)=>![X333:$i]:(((in @ X333 @ nat)=>![X332:$i]:(((in @ X332 @ nat)=>(((n_pl @ X334 @ X333)=(n_pl @ X334 @ X332))=>((X333)=(X332))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz8a]), c_0_11]), c_0_12])])).
0.40/0.59	thf(c_0_15, negated_conjecture, ~(![X326:$i]:(((in @ X326 @ nat)=>![X325:$i]:(((in @ X325 @ nat)=>![X323:$i]:(((in @ X323 @ nat)=>![X324:$i]:(((in @ X324 @ nat)=>(((X326)=(n_pl @ X325 @ X323))=>(((X326)=(n_pl @ X325 @ X324))=>((X323)=(X324))))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz8b])]), c_0_13]), c_0_11]), c_0_12])).
0.40/0.59	thf(c_0_16, plain, ![X419:$i, X420:$i, X421:$i]:((~(in @ X419 @ nat)|(~(in @ X420 @ nat)|(~(in @ X421 @ nat)|(((n_pl @ X419 @ X420)!=(n_pl @ X419 @ X421))|((X420)=(X421))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])).
0.40/0.59	thf(c_0_17, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((in @ esk3_0 @ nat)&((in @ esk4_0 @ nat)&(((esk1_0)=(n_pl @ esk2_0 @ esk3_0))&(((esk1_0)=(n_pl @ esk2_0 @ esk4_0))&((esk3_0)!=(esk4_0)))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])).
0.40/0.59	thf(c_0_18, plain, ![X1:$i, X4:$i, X5:$i]:((((X4)=(X5))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat))|((n_pl @ X1 @ X4)!=(n_pl @ X1 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.40/0.59	thf(c_0_19, negated_conjecture, ((esk1_0)=(n_pl @ esk2_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.40/0.59	thf(c_0_20, negated_conjecture, (in @ esk4_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_17])).
0.40/0.59	thf(c_0_21, negated_conjecture, (in @ esk2_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_17])).
0.40/0.59	thf(c_0_22, negated_conjecture, ![X1:$i]:((((X1)=(esk4_0))|((n_pl @ esk2_0 @ X1)!=(esk1_0))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20]), c_0_21])])).
0.40/0.59	thf(c_0_23, negated_conjecture, ((esk1_0)=(n_pl @ esk2_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.40/0.59	thf(c_0_24, negated_conjecture, (in @ esk3_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_17])).
0.40/0.59	thf(c_0_25, negated_conjecture, ((esk3_0)!=(esk4_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.40/0.59	thf(c_0_26, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])]), c_0_25]), ['proof']).
0.40/0.59	# SZS output end CNFRefutation
0.40/0.59	# Parsed axioms                        : 330
0.40/0.59	# Removed by relevancy pruning/SinE    : 218
0.40/0.59	# Initial clauses                      : 144
0.40/0.59	# Removed in clause preprocessing      : 3
0.40/0.59	# Initial clauses in saturation        : 141
0.40/0.59	# Processed clauses                    : 244
0.40/0.59	# ...of these trivial                  : 4
0.40/0.59	# ...subsumed                          : 15
0.40/0.59	# ...remaining for further processing  : 225
0.40/0.59	# Other redundant clauses eliminated   : 8
0.40/0.59	# Clauses deleted for lack of memory   : 0
0.40/0.59	# Backward-subsumed                    : 0
0.40/0.59	# Backward-rewritten                   : 0
0.40/0.59	# Generated clauses                    : 228
0.40/0.59	# ...of the previous two non-redundant : 204
0.40/0.59	# ...aggressively subsumed             : 0
0.40/0.59	# Contextual simplify-reflections      : 0
0.40/0.59	# Paramodulations                      : 183
0.40/0.59	# Factorizations                       : 0
0.40/0.59	# NegExts                              : 0
0.40/0.59	# Equation resolutions                 : 10
0.40/0.59	# Total rewrite steps                  : 43
0.40/0.59	# Propositional unsat checks           : 0
0.40/0.59	#    Propositional check models        : 0
0.40/0.59	#    Propositional check unsatisfiable : 0
0.40/0.59	#    Propositional clauses             : 0
0.40/0.59	#    Propositional clauses after purity: 0
0.40/0.59	#    Propositional unsat core size     : 0
0.40/0.59	#    Propositional preprocessing time  : 0.000
0.40/0.59	#    Propositional encoding time       : 0.000
0.40/0.59	#    Propositional solver time         : 0.000
0.40/0.59	#    Success case prop preproc time    : 0.000
0.40/0.59	#    Success case prop encoding time   : 0.000
0.40/0.59	#    Success case prop solver time     : 0.000
0.40/0.59	# Current number of processed clauses  : 97
0.40/0.59	#    Positive orientable unit clauses  : 27
0.40/0.59	#    Positive unorientable unit clauses: 4
0.40/0.59	#    Negative unit clauses             : 24
0.40/0.59	#    Non-unit-clauses                  : 42
0.40/0.59	# Current number of unprocessed clauses: 224
0.40/0.59	# ...number of literals in the above   : 628
0.40/0.59	# Current number of archived formulas  : 0
0.40/0.59	# Current number of archived clauses   : 126
0.40/0.59	# Clause-clause subsumption calls (NU) : 1440
0.40/0.59	# Rec. Clause-clause subsumption calls : 576
0.40/0.59	# Non-unit clause-clause subsumptions  : 13
0.40/0.59	# Unit Clause-clause subsumption calls : 264
0.40/0.59	# Rewrite failures with RHS unbound    : 2
0.40/0.59	# BW rewrite match attempts            : 9
0.40/0.59	# BW rewrite match successes           : 0
0.40/0.59	# Condensation attempts                : 0
0.40/0.59	# Condensation successes               : 0
0.40/0.59	# Termbank termtop insertions          : 25945
0.40/0.59	
0.40/0.59	# -------------------------------------------------
0.40/0.59	# User time                : 0.037 s
0.40/0.59	# System time              : 0.009 s
0.40/0.59	# Total time               : 0.046 s
0.40/0.59	# Maximum resident set size: 3600 pages
2.45/1.87	
2.45/1.87	# -------------------------------------------------
2.45/1.87	# User time                : 0.044 s
2.45/1.87	# System time              : 0.012 s
2.45/1.87	# Total time               : 0.056 s
2.45/1.87	# Maximum resident set size: 2168 pages
2.45/1.87	% E---3.1 exiting
2.45/1.88	EOF